Math 697 Iterative Proportional Scaling
نویسنده
چکیده
The purpose of this project is to show observations taken from the Iterative Proportional Scaling algorithm when used with data taken from Hierarchical LogLinear Models. We show with empirical proof that the difference between decomposable and non-decomposable graph models used is not exceedingly different. For the purpose of this project we looked at the properties of the two, three, and four variable case of graph models.
منابع مشابه
Vector and matrix apportionment problems and separable convex integer optimization
Algorithms for the proportional rounding of a nonnegative vector, and for the biproportional rounding of a nonnegative matrix are discussed. Here we view vector and matrix rounding as special instances of a generic optimization problem that employs an additive version of the objective function of Gaffke and Pukelsheim (2007). The generic problem turns out to be a separable convex integer optimi...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Iterative proportional scaling via decomposable submodels for contingency tables
We propose iterative proportional scaling (IPS) via decomposable submodels for maximizing likelihood function of a hierarchical model for contingency tables. In ordinary IPS the proportional scaling is performed by cycling through the elements of the generating class of a hierarchical model. We propose to adjust more marginals at each step. This is accomplished by expressing the generating clas...
متن کاملIterative proportional scaling via decomposable submodels for contingency tables
We propose iterative proportional scaling (IPS) via decomposable submodels for maximizing likelihood function of a hierarchical model for contingency tables. In ordinary IPS the proportional scaling is performed by cycling through the members of the generating class of a hierarchical model. We propose to adjust more marginals at each step. This is accomplished by expressing the generating class...
متن کاملA Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models
We discuss an efficient implementation of the iterative proportional scaling procedure in the multivariate Gaussian graphical models. We show that the computational cost can be reduced by localization of the update procedure in each iterative step by using the structure of a decomposable model obtained by triangulation of the graph associated with the model. Some numerical experiments demonstra...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models
We discuss an efficient implementation of the iterative proportional scaling procedure in the multivariate Gaussian graphical models. We show that the computational cost can be reduced by localization of the update procedure in each iterative step by using the structure of a decomposable model obtained by triangulation of the graph associated with the model. Some numerical experiments demonstra...
متن کامل